Discretization of Timed Automata in Timed μCRL à la Regions and Zones

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discretization of Timed Automata in Timed μCRL à la Regions and Zones

We present the first step towards combining the best parts of the real-time verification methods based on timed automata (the use of regions and zones), and of the process-algebraic approach of languages like LOTOS and μCRL. μCRL targets the specification of system behavior in a process-algebraic (ACP) style and deals with data elements in the form of abstract data types. A timed automata speci...

متن کامل

Time Abstraction in Timed μCRL à la Regions

We present the first step towards combining the best parts of the real-time verification methods based on timed automata (the use of regions and zones), and of the processalgebraic approach of languages like LOTOS and μCRL. This could provide with additional verification possibilities for Real-Time systems, not available in existing timedautomata-based tools like UPPAAL [14]. The language μCRL,...

متن کامل

Discretization of Timed Automata

We construct two discretizations of dense time automata which generate the same untimed language as the dense time automata.

متن کامل

On Discretization of Delays in Timed Automata and Digital Circuits

In this paper we solve the following problem given a digital circuit composed of gates whose real valued delays are in an integer bounded interval is there a way to discretize time while preserving the qualitative behavior of the circuit This problem is described as open in BS When preservation of qualitative behavior is interpreted in a strict sense as having all original sequences of events w...

متن کامل

Timed Unfoldings for Networks of Timed Automata

Whereas partial order methods have proved their efficiency for the analysis of discrete-event systems, their application to timed systems remains a challenging research topic. Here, we design a verification algorithm for networks of timed automata with invariants. Based on the unfolding technique, our method produces a branching process as an acyclic Petri net extended with read arcs. These arc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Notes in Theoretical Computer Science

سال: 2006

ISSN: 1571-0661

DOI: 10.1016/j.entcs.2005.12.084